Constructions of new q-cryptomorphisms
نویسندگان
چکیده
In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which described as matroid cryptomorphisms . A q -matroid is -analogue where subspaces play role subsets in theory. this article we establish -matroids. doing so highlight difference between and its -analogue. We introduce comprehensive set axiom show them existing -matroid. These axioms rank, closure, basis, independence, dependence, circuit, hyperplane , flat, open space, spanning non-spanning bi-colouring axioms.
منابع مشابه
New Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کاملNEW INDUCTIVE CONSTRUCTIONS OF COMPLETE CAPS IN PG ( N , q ) , q EVEN
Some new families of small complete caps in PG(N, q), q even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem in the plane. The caps constructed in this paper provide an improvement on the currently known upper bounds on the size of the smallest complete cap in PG(N, q...
متن کاملNew Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$
Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...
متن کاملConvertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملNew epsilon-net constructions
In this paper, we give simple and intuitive constructions to obtain linear size -nets for α-fat wedges, translations and rotations of a quadrant and axis-parallel three-sided rectangles in R. We also give new constructions using elementary geometry to obtain linear size weak -net for d-hypercubes and disks in R.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.12.001